﻿//
// Copyright (c) 2011 HyperCrunch, Inc. http://www.hypercrunch.com 
// Author: Nik Kalyani  http://www.kalyani.com (Twitter: @techbubble)
//
// Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated 
// documentation files (the "Software"), to deal in the Software without restriction, including without limitation 
// the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and 
// to permit persons to whom the Software is furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all copies or substantial portions 
// of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED 
// TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL 
// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF 
// CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER 
// DEALINGS IN THE SOFTWARE.
//

using System;
using System.Collections;
using System.Collections.Generic;

namespace HyperCrunch.Druid
{
    [Serializable()]
    public class RuleCollection : CollectionBase
    {
        public void Add(Rule r)
        {
            this.InnerList.Add(r);
        }

        public int FindMatchingId(string id)
        {
            id = id.ToLower();
            for(int r=0;r<this.InnerList.Count;r++)
            {
                if (((Rule)this.InnerList[r]).Id.ToLower() == id)
                    return r;
            }
            return -1;
        }

        public virtual Rule this[int index]
        {
            get { return (Rule)base.List[index]; }
            set { base.List[index] = value; }
        }

        public void SortByOrder()
        {
            IComparer sorter = new OrderSortHelper();
            InnerList.Sort(sorter);
            foreach (Rule r in InnerList)
                if (r.Rules != null)
                    r.Rules.SortByOrder();
        }

        private class OrderSortHelper : IComparer
        {
            public int Compare(object x, object y)
            {
                Rule r1 = (Rule)x;
                Rule r2 = (Rule)y;

                //Transform Portal Order into a negative number to force it to take precedence
                if (!r1.IsHostRule)
                    r1.Order = r1.Order - (r1.Order + r1.Order);

                if (!r2.IsHostRule)
                    r2.Order = r2.Order - (r2.Order + r1.Order);

                return r1.Order.CompareTo(r2.Order);
            }

        }
    }
}
